Improved local search for universal facility location
نویسندگان
چکیده
منابع مشابه
Improved Local Search for Universal Facility Location
We consider the universal facility location problem in which the goal is to assign clients to facilities in order to minimize the sum of connection and facility costs. The connection cost is proportional to the distance each client has to travel to its assigned facility, whereas the cost of a facility is a non-decreasing function depending on the number of clients assigned to the facility. This...
متن کاملFrom stars to comets: Improved local search for universal facility location
We improve the approximation ratio for the Universal Facility Location Problem to 6.702 by a local search algorithm with an extended pivot operation. 1 The Universal Facility Location Problem Many approximation algorithms for various facility location problems have been proposed recently. See Vygen [2005] for a survey. A quite general problem, generalizing many others considered previously, has...
متن کاملLocal Search Heuristics for Facility Location Problems
In this thesis, we develop approximation algorithms for facility location problems based on local search techniques. Facility location is an important problem in operations research. Heuristic approaches have been used to solve many variants of the problem since the 1960s. The study of approximation algorithms for facility location problems started with the work of Hochbaum. Although local sear...
متن کاملUniversal Facility Location
In the Universal Facility Location problem we are given a set of demand points and a set of facilities. The goal is to assign the demands to facilities in such a way that the sum of service and facility costs is minimized. The service cost is proportional to the distance each unit of demand has to travel to its assigned facility, whereas the facility cost of each facility i depends on the amoun...
متن کاملLocal-Search based Approximation Algorithms for Mobile Facility Location Problems
We consider the mobile facility location (MFL) problem. We are given a set of facilities and clients located in a common metric space G = (V, c). The goal is to move each facility from its initial location to a destination (in V ) and assign each client to the destination of some facility so as to minimize the sum of the movement-costs of the facilities and the client-assignment costs. This abs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2014
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-014-9711-7